./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044.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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:21:25,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:21:25,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:21:25,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:21:25,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:21:25,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:21:25,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:21:25,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:21:25,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:21:25,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:21:25,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:21:25,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:21:25,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:21:25,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:21:25,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:21:25,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:21:25,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:21:25,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:21:25,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:21:25,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:21:25,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:21:25,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:21:25,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:21:25,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:21:25,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:21:25,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:21:25,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:21:25,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:21:25,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:21:25,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:21:25,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:21:25,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:21:25,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:21:25,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:21:25,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:21:25,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:21:25,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:21:25,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:21:25,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:21:25,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:21:25,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:21:25,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:21:25,617 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:21:25,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:21:25,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:21:25,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:21:25,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:21:25,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:21:25,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:21:25,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:21:25,621 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:21:25,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:21:25,622 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:21:25,622 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:21:25,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:21:25,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:21:25,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:21:25,623 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:21:25,623 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:21:25,623 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:21:25,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:21:25,624 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:21:25,624 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:21:25,624 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:21:25,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:21:25,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:21:25,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:21:25,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:21:25,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:21:25,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:21:25,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:21:25,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:21:25,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:21:25,626 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:21:25,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:21:25,626 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:21:25,626 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:21:25,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:21:25,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:21:25,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:21:25,926 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:21:25,927 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:21:25,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-08-31 23:21:27,126 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:21:27,373 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:21:27,373 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-08-31 23:21:27,383 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ed74429/66dd0d8823f94989ac65971295f4c88f/FLAG54d747f5d [2023-08-31 23:21:27,395 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ed74429/66dd0d8823f94989ac65971295f4c88f [2023-08-31 23:21:27,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:21:27,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:21:27,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:21:27,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:21:27,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:21:27,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:27,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66194d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27, skipping insertion in model container [2023-08-31 23:21:27,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:27,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:21:27,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:21:27,566 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/mix044.opt.i[944,957] [2023-08-31 23:21:27,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:21:27,769 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:21:27,782 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/mix044.opt.i[944,957] [2023-08-31 23:21:27,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:21:27,886 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:21:27,886 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:21:27,892 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:21:27,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27 WrapperNode [2023-08-31 23:21:27,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:21:27,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:21:27,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:21:27,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:21:27,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:27,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:27,969 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-31 23:21:27,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:21:27,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:21:27,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:21:27,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:21:27,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:27,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:27,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:27,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:28,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:28,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:28,020 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:28,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:28,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:21:28,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:21:28,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:21:28,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:21:28,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (1/1) ... [2023-08-31 23:21:28,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:21:28,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:21:28,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:21:28,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:21:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:21:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:21:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:21:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:21:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:21:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:21:28,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:21:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:21:28,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:21:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:21:28,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:21:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:21:28,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:21:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:21:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:21:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:21:28,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:21:28,118 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:21:28,320 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:21:28,322 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:21:28,680 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:21:28,768 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:21:28,769 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:21:28,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:28 BoogieIcfgContainer [2023-08-31 23:21:28,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:21:28,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:21:28,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:21:28,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:21:28,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:21:27" (1/3) ... [2023-08-31 23:21:28,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dca3442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:21:28, skipping insertion in model container [2023-08-31 23:21:28,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:27" (2/3) ... [2023-08-31 23:21:28,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dca3442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:21:28, skipping insertion in model container [2023-08-31 23:21:28,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:28" (3/3) ... [2023-08-31 23:21:28,778 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2023-08-31 23:21:28,792 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:21:28,792 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:21:28,793 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:21:28,836 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:21:28,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-31 23:21:28,932 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-31 23:21:28,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:28,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:21:28,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-31 23:21:28,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-31 23:21:28,946 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:21:28,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-31 23:21:28,956 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-31 23:21:28,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-31 23:21:28,979 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-31 23:21:28,980 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:28,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:21:28,983 INFO L119 LiptonReduction]: Number of co-enabled transitions 3258 [2023-08-31 23:21:33,391 INFO L134 LiptonReduction]: Checked pairs total: 8840 [2023-08-31 23:21:33,392 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-31 23:21:33,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:21:33,410 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;@7954ab33, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:21:33,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:21:33,411 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:21:33,411 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:33,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:33,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:21:33,412 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-31 23:21:33,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2023-08-31 23:21:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078472547] [2023-08-31 23:21:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:33,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:33,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078472547] [2023-08-31 23:21:33,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078472547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:33,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:21:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662843516] [2023-08-31 23:21:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:33,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:21:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:33,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:21:33,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:21:33,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 277 [2023-08-31 23:21:33,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:33,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 277 [2023-08-31 23:21:33,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:34,157 INFO L130 PetriNetUnfolder]: 4151/5767 cut-off events. [2023-08-31 23:21:34,158 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-31 23:21:34,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11559 conditions, 5767 events. 4151/5767 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 29860 event pairs, 4151 based on Foata normal form. 180/4998 useless extension candidates. Maximal degree in co-relation 11547. Up to 5689 conditions per place. [2023-08-31 23:21:34,202 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:21:34,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-08-31 23:21:34,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:21:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:21:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-31 23:21:34,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288808664259927 [2023-08-31 23:21:34,249 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-31 23:21:34,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-31 23:21:34,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:34,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-31 23:21:34,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,273 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,274 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 293 transitions. [2023-08-31 23:21:34,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-08-31 23:21:34,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:21:34,323 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:21:34,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:21:34,328 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:21:34,328 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:21:34,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:34,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:34,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:21:34,333 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-31 23:21:34,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1727386017, now seen corresponding path program 1 times [2023-08-31 23:21:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426707169] [2023-08-31 23:21:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:34,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426707169] [2023-08-31 23:21:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426707169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:34,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:34,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:21:34,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182073599] [2023-08-31 23:21:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:34,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:21:34,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:34,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:21:34,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:21:34,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 277 [2023-08-31 23:21:34,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:34,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 277 [2023-08-31 23:21:34,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:35,202 INFO L130 PetriNetUnfolder]: 3299/5149 cut-off events. [2023-08-31 23:21:35,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:35,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9798 conditions, 5149 events. 3299/5149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31712 event pairs, 743 based on Foata normal form. 0/4704 useless extension candidates. Maximal degree in co-relation 9795. Up to 3421 conditions per place. [2023-08-31 23:21:35,226 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 33 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-31 23:21:35,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 174 flow [2023-08-31 23:21:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:21:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:21:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-31 23:21:35,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102286401925391 [2023-08-31 23:21:35,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-31 23:21:35,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-31 23:21:35,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:35,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-31 23:21:35,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,239 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 424 transitions. [2023-08-31 23:21:35,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 174 flow [2023-08-31 23:21:35,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:21:35,240 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-31 23:21:35,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 23:21:35,241 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:21:35,241 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-31 23:21:35,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:35,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:35,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:21:35,242 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-31 23:21:35,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1738133616, now seen corresponding path program 1 times [2023-08-31 23:21:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827579431] [2023-08-31 23:21:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:36,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:36,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827579431] [2023-08-31 23:21:36,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827579431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:36,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:36,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704039048] [2023-08-31 23:21:36,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:36,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:21:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:21:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:21:36,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 277 [2023-08-31 23:21:36,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:36,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 277 [2023-08-31 23:21:36,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:36,883 INFO L130 PetriNetUnfolder]: 2594/3784 cut-off events. [2023-08-31 23:21:36,883 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2023-08-31 23:21:36,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7658 conditions, 3784 events. 2594/3784 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 19685 event pairs, 324 based on Foata normal form. 0/3784 useless extension candidates. Maximal degree in co-relation 7654. Up to 2097 conditions per place. [2023-08-31 23:21:36,938 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 42 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-31 23:21:36,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 208 flow [2023-08-31 23:21:36,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2023-08-31 23:21:36,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4259927797833935 [2023-08-31 23:21:36,941 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2023-08-31 23:21:36,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2023-08-31 23:21:36,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:36,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2023-08-31 23:21:36,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,949 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,949 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 7 states and 826 transitions. [2023-08-31 23:21:36,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 208 flow [2023-08-31 23:21:36,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:36,952 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 72 flow [2023-08-31 23:21:36,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-31 23:21:36,954 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-08-31 23:21:36,957 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 72 flow [2023-08-31 23:21:36,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:36,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:36,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:21:36,958 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-31 23:21:36,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1738133677, now seen corresponding path program 1 times [2023-08-31 23:21:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:36,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068448482] [2023-08-31 23:21:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068448482] [2023-08-31 23:21:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068448482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:21:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612570600] [2023-08-31 23:21:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:38,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:38,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:38,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-31 23:21:38,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:38,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:38,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-31 23:21:38,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:39,430 INFO L130 PetriNetUnfolder]: 9099/12592 cut-off events. [2023-08-31 23:21:39,430 INFO L131 PetriNetUnfolder]: For 639/639 co-relation queries the response was YES. [2023-08-31 23:21:39,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26085 conditions, 12592 events. 9099/12592 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 66752 event pairs, 1345 based on Foata normal form. 572/13162 useless extension candidates. Maximal degree in co-relation 26081. Up to 7953 conditions per place. [2023-08-31 23:21:39,501 INFO L137 encePairwiseOnDemand]: 265/277 looper letters, 52 selfloop transitions, 12 changer transitions 39/104 dead transitions. [2023-08-31 23:21:39,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 104 transitions, 462 flow [2023-08-31 23:21:39,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 911 transitions. [2023-08-31 23:21:39,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698298091799897 [2023-08-31 23:21:39,506 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 911 transitions. [2023-08-31 23:21:39,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 911 transitions. [2023-08-31 23:21:39,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:39,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 911 transitions. [2023-08-31 23:21:39,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.14285714285714) internal successors, (911), 7 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:39,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:39,513 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:39,513 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 72 flow. Second operand 7 states and 911 transitions. [2023-08-31 23:21:39,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 104 transitions, 462 flow [2023-08-31 23:21:39,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 104 transitions, 438 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:21:39,519 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 159 flow [2023-08-31 23:21:39,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-31 23:21:39,520 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-31 23:21:39,520 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 159 flow [2023-08-31 23:21:39,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:39,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:39,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:39,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:21:39,522 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-31 23:21:39,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1952407418, now seen corresponding path program 1 times [2023-08-31 23:21:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742393413] [2023-08-31 23:21:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:40,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:40,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742393413] [2023-08-31 23:21:40,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742393413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:40,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:21:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180992841] [2023-08-31 23:21:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:40,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:40,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:40,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-31 23:21:40,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:40,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:40,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-31 23:21:40,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:41,608 INFO L130 PetriNetUnfolder]: 7813/10934 cut-off events. [2023-08-31 23:21:41,608 INFO L131 PetriNetUnfolder]: For 8124/8124 co-relation queries the response was YES. [2023-08-31 23:21:41,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33058 conditions, 10934 events. 7813/10934 cut-off events. For 8124/8124 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 56082 event pairs, 1797 based on Foata normal form. 480/11392 useless extension candidates. Maximal degree in co-relation 33049. Up to 5393 conditions per place. [2023-08-31 23:21:41,683 INFO L137 encePairwiseOnDemand]: 266/277 looper letters, 49 selfloop transitions, 11 changer transitions 37/98 dead transitions. [2023-08-31 23:21:41,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 587 flow [2023-08-31 23:21:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-31 23:21:41,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595152140278494 [2023-08-31 23:21:41,687 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-31 23:21:41,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-31 23:21:41,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:41,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-31 23:21:41,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:41,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:41,695 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:41,695 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 159 flow. Second operand 7 states and 891 transitions. [2023-08-31 23:21:41,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 587 flow [2023-08-31 23:21:41,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 579 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:41,872 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 256 flow [2023-08-31 23:21:41,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-08-31 23:21:41,874 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-31 23:21:41,874 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 256 flow [2023-08-31 23:21:41,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:41,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:41,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:41,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:21:41,875 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-31 23:21:41,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:41,876 INFO L85 PathProgramCache]: Analyzing trace with hash 299136176, now seen corresponding path program 1 times [2023-08-31 23:21:41,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:41,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380014245] [2023-08-31 23:21:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380014245] [2023-08-31 23:21:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380014245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:42,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:42,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754200197] [2023-08-31 23:21:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:42,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:42,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:42,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:42,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-31 23:21:42,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:42,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:42,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-31 23:21:42,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:43,510 INFO L130 PetriNetUnfolder]: 6524/9698 cut-off events. [2023-08-31 23:21:43,511 INFO L131 PetriNetUnfolder]: For 14016/14280 co-relation queries the response was YES. [2023-08-31 23:21:43,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31554 conditions, 9698 events. 6524/9698 cut-off events. For 14016/14280 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 56116 event pairs, 1986 based on Foata normal form. 478/9995 useless extension candidates. Maximal degree in co-relation 31541. Up to 6151 conditions per place. [2023-08-31 23:21:43,574 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 55 selfloop transitions, 7 changer transitions 21/94 dead transitions. [2023-08-31 23:21:43,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 635 flow [2023-08-31 23:21:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 819 transitions. [2023-08-31 23:21:43,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927797833935018 [2023-08-31 23:21:43,577 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 819 transitions. [2023-08-31 23:21:43,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 819 transitions. [2023-08-31 23:21:43,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:43,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 819 transitions. [2023-08-31 23:21:43,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:43,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:43,583 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:43,583 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 256 flow. Second operand 6 states and 819 transitions. [2023-08-31 23:21:43,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 635 flow [2023-08-31 23:21:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 626 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:43,705 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 320 flow [2023-08-31 23:21:43,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-31 23:21:43,706 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-31 23:21:43,706 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 320 flow [2023-08-31 23:21:43,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:43,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:43,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:43,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:21:43,707 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-31 23:21:43,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1268894839, now seen corresponding path program 1 times [2023-08-31 23:21:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156794211] [2023-08-31 23:21:43,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:44,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156794211] [2023-08-31 23:21:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156794211] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072704688] [2023-08-31 23:21:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:44,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:21:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:44,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:21:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:21:44,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 277 [2023-08-31 23:21:44,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:44,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:44,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 277 [2023-08-31 23:21:44,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:46,479 INFO L130 PetriNetUnfolder]: 10353/14314 cut-off events. [2023-08-31 23:21:46,479 INFO L131 PetriNetUnfolder]: For 22475/22475 co-relation queries the response was YES. [2023-08-31 23:21:46,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52322 conditions, 14314 events. 10353/14314 cut-off events. For 22475/22475 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 72427 event pairs, 2485 based on Foata normal form. 240/14554 useless extension candidates. Maximal degree in co-relation 52305. Up to 8616 conditions per place. [2023-08-31 23:21:46,598 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 87 selfloop transitions, 62 changer transitions 33/182 dead transitions. [2023-08-31 23:21:46,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 182 transitions, 1485 flow [2023-08-31 23:21:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:21:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:21:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1248 transitions. [2023-08-31 23:21:46,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4505415162454874 [2023-08-31 23:21:46,603 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1248 transitions. [2023-08-31 23:21:46,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1248 transitions. [2023-08-31 23:21:46,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:46,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1248 transitions. [2023-08-31 23:21:46,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.8) internal successors, (1248), 10 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:46,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:46,611 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:46,611 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 320 flow. Second operand 10 states and 1248 transitions. [2023-08-31 23:21:46,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 182 transitions, 1485 flow [2023-08-31 23:21:46,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 182 transitions, 1459 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-31 23:21:46,682 INFO L231 Difference]: Finished difference. Result has 72 places, 104 transitions, 1038 flow [2023-08-31 23:21:46,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1038, PETRI_PLACES=72, PETRI_TRANSITIONS=104} [2023-08-31 23:21:46,683 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-08-31 23:21:46,683 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 104 transitions, 1038 flow [2023-08-31 23:21:46,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:46,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:46,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:46,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:21:46,684 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-31 23:21:46,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash 864467483, now seen corresponding path program 2 times [2023-08-31 23:21:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557239468] [2023-08-31 23:21:46,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:47,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:47,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557239468] [2023-08-31 23:21:47,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557239468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:47,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:47,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:47,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421465592] [2023-08-31 23:21:47,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:47,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:21:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:47,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:21:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:21:47,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:21:47,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 104 transitions, 1038 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:47,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:47,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:21:47,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:48,807 INFO L130 PetriNetUnfolder]: 8311/11947 cut-off events. [2023-08-31 23:21:48,807 INFO L131 PetriNetUnfolder]: For 46633/48480 co-relation queries the response was YES. [2023-08-31 23:21:48,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54232 conditions, 11947 events. 8311/11947 cut-off events. For 46633/48480 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 68243 event pairs, 3826 based on Foata normal form. 696/12129 useless extension candidates. Maximal degree in co-relation 54209. Up to 7448 conditions per place. [2023-08-31 23:21:48,892 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 67 selfloop transitions, 24 changer transitions 21/143 dead transitions. [2023-08-31 23:21:48,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 143 transitions, 1556 flow [2023-08-31 23:21:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2023-08-31 23:21:48,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48014440433212996 [2023-08-31 23:21:48,895 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 798 transitions. [2023-08-31 23:21:48,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 798 transitions. [2023-08-31 23:21:48,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:48,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 798 transitions. [2023-08-31 23:21:48,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:48,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:48,901 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:48,901 INFO L175 Difference]: Start difference. First operand has 72 places, 104 transitions, 1038 flow. Second operand 6 states and 798 transitions. [2023-08-31 23:21:48,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 143 transitions, 1556 flow [2023-08-31 23:21:49,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 143 transitions, 1523 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-31 23:21:49,038 INFO L231 Difference]: Finished difference. Result has 73 places, 107 transitions, 1142 flow [2023-08-31 23:21:49,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1142, PETRI_PLACES=73, PETRI_TRANSITIONS=107} [2023-08-31 23:21:49,040 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-31 23:21:49,040 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 107 transitions, 1142 flow [2023-08-31 23:21:49,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:49,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:49,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:49,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:21:49,041 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-31 23:21:49,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1142242737, now seen corresponding path program 1 times [2023-08-31 23:21:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353010478] [2023-08-31 23:21:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353010478] [2023-08-31 23:21:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353010478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:49,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:49,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:21:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421916024] [2023-08-31 23:21:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:49,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:21:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:49,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:21:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:21:49,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:21:49,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 107 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:49,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:49,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:21:49,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:49,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][119], [60#L829true, Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 247#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 131#L786true, 186#true, 91#P0EXITtrue, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 202#true, 23#L768true, Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 93#L858true]) [2023-08-31 23:21:49,580 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,580 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,580 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,580 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,581 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][47], [Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 247#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 186#true, 91#P0EXITtrue, 95#L822true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), 67#L793true, P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 202#true, 23#L768true, 219#(= ~z$r_buff0_thd0~0 0), Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), 93#L858true]) [2023-08-31 23:21:49,583 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,583 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,584 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,584 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,667 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([342] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_60 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_103 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_93 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_104 256) 0))))) (and (= v_~z$r_buff0_thd0~0_59 (ite .cse0 0 v_~z$r_buff0_thd0~0_60)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92) (= v_~z~0_59 (ite .cse2 v_~z$w_buff0~0_48 (ite .cse1 v_~z$w_buff1~0_51 v_~z~0_60))) (= v_~z$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_92 256) 0)))) 0 v_~z$r_buff1_thd0~0_56)) (= (ite .cse2 0 v_~z$w_buff0_used~0_104) v_~z$w_buff0_used~0_103)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_56, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_60} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_55, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_59} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0][99], [Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 131#L786true, 186#true, 91#P0EXITtrue, 95#L822true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 202#true, 23#L768true, 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), 125#L864true, Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))]) [2023-08-31 23:21:49,668 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,668 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,668 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,668 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([342] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_60 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_103 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_93 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_104 256) 0))))) (and (= v_~z$r_buff0_thd0~0_59 (ite .cse0 0 v_~z$r_buff0_thd0~0_60)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92) (= v_~z~0_59 (ite .cse2 v_~z$w_buff0~0_48 (ite .cse1 v_~z$w_buff1~0_51 v_~z~0_60))) (= v_~z$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_92 256) 0)))) 0 v_~z$r_buff1_thd0~0_56)) (= (ite .cse2 0 v_~z$w_buff0_used~0_104) v_~z$w_buff0_used~0_103)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_56, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_60} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_55, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_59} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0][99], [Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 131#L786true, 186#true, 91#P0EXITtrue, 69#L819true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 121#L771true, 202#true, 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), 125#L864true, Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))]) [2023-08-31 23:21:49,672 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,672 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,672 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,673 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,673 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][47], [Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 247#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 186#true, 91#P0EXITtrue, 69#L819true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), 67#L793true, P2Thread1of1ForFork3InUse, 121#L771true, 202#true, Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 93#L858true]) [2023-08-31 23:21:49,673 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,673 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,674 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,674 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,709 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([411] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][119], [60#L829true, Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 247#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 131#L786true, Black: 188#(= ~__unbuffered_p3_EAX~0 0), 91#P0EXITtrue, 186#true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 202#true, 23#L768true, Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 93#L858true]) [2023-08-31 23:21:49,709 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,710 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([342] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_60 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_103 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_93 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_104 256) 0))))) (and (= v_~z$r_buff0_thd0~0_59 (ite .cse0 0 v_~z$r_buff0_thd0~0_60)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92) (= v_~z~0_59 (ite .cse2 v_~z$w_buff0~0_48 (ite .cse1 v_~z$w_buff1~0_51 v_~z~0_60))) (= v_~z$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_92 256) 0)))) 0 v_~z$r_buff1_thd0~0_56)) (= (ite .cse2 0 v_~z$w_buff0_used~0_104) v_~z$w_buff0_used~0_103)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_56, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_60} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_55, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_59} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0][99], [Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 131#L786true, 186#true, 91#P0EXITtrue, 95#L822true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 202#true, 23#L768true, 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), 125#L864true, Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)))]) [2023-08-31 23:21:49,711 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,711 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,711 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,711 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,711 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,711 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([401] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][47], [Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), 247#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 91#P0EXITtrue, 186#true, 95#L822true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P1Thread1of1ForFork0InUse, 67#L793true, P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 202#true, 23#L768true, 219#(= ~z$r_buff0_thd0~0 0), Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), 93#L858true]) [2023-08-31 23:21:49,712 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,712 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,712 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,712 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,712 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:21:49,766 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][119], [60#L829true, Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 247#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 131#L786true, 186#true, 91#P0EXITtrue, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 121#L771true, 202#true, Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 93#L858true]) [2023-08-31 23:21:49,767 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,767 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,767 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,767 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,767 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([342] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_60 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_103 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_93 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_104 256) 0))))) (and (= v_~z$r_buff0_thd0~0_59 (ite .cse0 0 v_~z$r_buff0_thd0~0_60)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92) (= v_~z~0_59 (ite .cse2 v_~z$w_buff0~0_48 (ite .cse1 v_~z$w_buff1~0_51 v_~z~0_60))) (= v_~z$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_92 256) 0)))) 0 v_~z$r_buff1_thd0~0_56)) (= (ite .cse2 0 v_~z$w_buff0_used~0_104) v_~z$w_buff0_used~0_103)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_56, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_60} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_55, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_59} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0][99], [Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 131#L786true, 186#true, 91#P0EXITtrue, 95#L822true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork3InUse, 121#L771true, 202#true, 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), 125#L864true, Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))]) [2023-08-31 23:21:49,768 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,768 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,768 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,769 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][47], [Black: 253#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 248#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 255#(and (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 247#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 186#true, 91#P0EXITtrue, 95#L822true, 260#true, 156#true, P3Thread1of1ForFork1InUse, Black: 211#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 205#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork2InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), 67#L793true, P2Thread1of1ForFork3InUse, 121#L771true, 202#true, Black: 225#(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$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$r_buff0_thd0~0 0)), 219#(= ~z$r_buff0_thd0~0 0), Black: 220#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 227#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 171#true, Black: 229#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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_#in~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 173#(= ~x~0 0), 169#(and (not (= |ULTIMATE.start_main_~#t1166~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1165~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1167~0#1.base| 0) |ULTIMATE.start_main_~#t1168~0#1.base| 0) |ULTIMATE.start_main_~#t1166~0#1.base| 0) |ULTIMATE.start_main_~#t1165~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1168~0#1.base| |ULTIMATE.start_main_~#t1167~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1167~0#1.base| |ULTIMATE.start_main_~#t1166~0#1.base|))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~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))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~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)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 93#L858true]) [2023-08-31 23:21:49,769 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,770 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,770 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:49,770 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:21:50,033 INFO L130 PetriNetUnfolder]: 4785/7049 cut-off events. [2023-08-31 23:21:50,034 INFO L131 PetriNetUnfolder]: For 36903/38405 co-relation queries the response was YES. [2023-08-31 23:21:50,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33944 conditions, 7049 events. 4785/7049 cut-off events. For 36903/38405 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 39940 event pairs, 1178 based on Foata normal form. 721/7311 useless extension candidates. Maximal degree in co-relation 33921. Up to 5590 conditions per place. [2023-08-31 23:21:50,093 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 110 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2023-08-31 23:21:50,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 151 transitions, 1800 flow [2023-08-31 23:21:50,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:21:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:21:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-31 23:21:50,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49458483754512633 [2023-08-31 23:21:50,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-31 23:21:50,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-31 23:21:50,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:50,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-31 23:21:50,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,100 INFO L175 Difference]: Start difference. First operand has 73 places, 107 transitions, 1142 flow. Second operand 3 states and 411 transitions. [2023-08-31 23:21:50,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 151 transitions, 1800 flow [2023-08-31 23:21:50,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 151 transitions, 1741 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-31 23:21:50,163 INFO L231 Difference]: Finished difference. Result has 70 places, 110 transitions, 1122 flow [2023-08-31 23:21:50,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=70, PETRI_TRANSITIONS=110} [2023-08-31 23:21:50,164 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2023-08-31 23:21:50,164 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 110 transitions, 1122 flow [2023-08-31 23:21:50,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:50,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:50,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:21:50,165 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-31 23:21:50,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1324575720, now seen corresponding path program 1 times [2023-08-31 23:21:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:50,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4393228] [2023-08-31 23:21:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:50,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4393228] [2023-08-31 23:21:50,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4393228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:50,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:50,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:21:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306336658] [2023-08-31 23:21:50,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:21:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:21:50,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:21:50,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:21:50,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 110 transitions, 1122 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:50,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:21:50,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:50,874 INFO L130 PetriNetUnfolder]: 2434/3818 cut-off events. [2023-08-31 23:21:50,875 INFO L131 PetriNetUnfolder]: For 18887/19680 co-relation queries the response was YES. [2023-08-31 23:21:50,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19045 conditions, 3818 events. 2434/3818 cut-off events. For 18887/19680 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21093 event pairs, 365 based on Foata normal form. 587/4225 useless extension candidates. Maximal degree in co-relation 19023. Up to 1898 conditions per place. [2023-08-31 23:21:50,907 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 142 selfloop transitions, 9 changer transitions 0/187 dead transitions. [2023-08-31 23:21:50,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 187 transitions, 2181 flow [2023-08-31 23:21:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:21:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:21:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-31 23:21:50,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954873646209386 [2023-08-31 23:21:50,910 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-31 23:21:50,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-31 23:21:50,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:50,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-31 23:21:50,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,914 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,914 INFO L175 Difference]: Start difference. First operand has 70 places, 110 transitions, 1122 flow. Second operand 4 states and 549 transitions. [2023-08-31 23:21:50,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 187 transitions, 2181 flow [2023-08-31 23:21:50,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 187 transitions, 2176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:21:50,949 INFO L231 Difference]: Finished difference. Result has 73 places, 111 transitions, 1127 flow [2023-08-31 23:21:50,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1127, PETRI_PLACES=73, PETRI_TRANSITIONS=111} [2023-08-31 23:21:50,950 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-31 23:21:50,950 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 111 transitions, 1127 flow [2023-08-31 23:21:50,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:50,951 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-31 23:21:50,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:21:50,951 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-31 23:21:50,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash -835553240, now seen corresponding path program 1 times [2023-08-31 23:21:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:50,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563666185] [2023-08-31 23:21:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:51,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:51,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563666185] [2023-08-31 23:21:51,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563666185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:51,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:51,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:51,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137988728] [2023-08-31 23:21:51,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:51,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:51,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-31 23:21:51,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 111 transitions, 1127 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:51,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:51,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-31 23:21:51,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:52,480 INFO L130 PetriNetUnfolder]: 3784/5845 cut-off events. [2023-08-31 23:21:52,481 INFO L131 PetriNetUnfolder]: For 28554/28982 co-relation queries the response was YES. [2023-08-31 23:21:52,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31072 conditions, 5845 events. 3784/5845 cut-off events. For 28554/28982 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 31993 event pairs, 766 based on Foata normal form. 305/6054 useless extension candidates. Maximal degree in co-relation 31049. Up to 2848 conditions per place. [2023-08-31 23:21:52,519 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 112 selfloop transitions, 23 changer transitions 45/186 dead transitions. [2023-08-31 23:21:52,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 186 transitions, 2081 flow [2023-08-31 23:21:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-08-31 23:21:52,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46269554753309267 [2023-08-31 23:21:52,523 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-08-31 23:21:52,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-08-31 23:21:52,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:52,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-08-31 23:21:52,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,528 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,528 INFO L175 Difference]: Start difference. First operand has 73 places, 111 transitions, 1127 flow. Second operand 6 states and 769 transitions. [2023-08-31 23:21:52,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 186 transitions, 2081 flow [2023-08-31 23:21:52,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 186 transitions, 2047 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:52,576 INFO L231 Difference]: Finished difference. Result has 80 places, 100 transitions, 1074 flow [2023-08-31 23:21:52,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1074, PETRI_PLACES=80, PETRI_TRANSITIONS=100} [2023-08-31 23:21:52,576 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-08-31 23:21:52,577 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 100 transitions, 1074 flow [2023-08-31 23:21:52,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:52,577 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-31 23:21:52,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:21:52,578 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-31 23:21:52,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1395911212, now seen corresponding path program 1 times [2023-08-31 23:21:52,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:52,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183252776] [2023-08-31 23:21:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:52,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:52,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183252776] [2023-08-31 23:21:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183252776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:52,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:52,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733201434] [2023-08-31 23:21:52,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:52,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:52,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:52,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:52,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:52,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:21:52,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 100 transitions, 1074 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:52,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:21:52,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:53,132 INFO L130 PetriNetUnfolder]: 1572/2536 cut-off events. [2023-08-31 23:21:53,132 INFO L131 PetriNetUnfolder]: For 14278/14849 co-relation queries the response was YES. [2023-08-31 23:21:53,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13395 conditions, 2536 events. 1572/2536 cut-off events. For 14278/14849 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13692 event pairs, 215 based on Foata normal form. 456/2872 useless extension candidates. Maximal degree in co-relation 13368. Up to 1120 conditions per place. [2023-08-31 23:21:53,154 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 137 selfloop transitions, 13 changer transitions 6/182 dead transitions. [2023-08-31 23:21:53,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 182 transitions, 2262 flow [2023-08-31 23:21:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:21:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:21:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-08-31 23:21:53,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49458483754512633 [2023-08-31 23:21:53,157 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-08-31 23:21:53,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-08-31 23:21:53,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:53,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-08-31 23:21:53,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,162 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,162 INFO L175 Difference]: Start difference. First operand has 80 places, 100 transitions, 1074 flow. Second operand 5 states and 685 transitions. [2023-08-31 23:21:53,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 182 transitions, 2262 flow [2023-08-31 23:21:53,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 182 transitions, 2196 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-31 23:21:53,192 INFO L231 Difference]: Finished difference. Result has 80 places, 99 transitions, 1046 flow [2023-08-31 23:21:53,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1046, PETRI_PLACES=80, PETRI_TRANSITIONS=99} [2023-08-31 23:21:53,193 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-08-31 23:21:53,193 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 99 transitions, 1046 flow [2023-08-31 23:21:53,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:53,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:53,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:21:53,194 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-31 23:21:53,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1999516709, now seen corresponding path program 1 times [2023-08-31 23:21:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565698565] [2023-08-31 23:21:53,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565698565] [2023-08-31 23:21:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565698565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:53,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971480872] [2023-08-31 23:21:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:53,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:53,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-08-31 23:21:53,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 99 transitions, 1046 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:53,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-08-31 23:21:53,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:54,640 INFO L130 PetriNetUnfolder]: 2784/4395 cut-off events. [2023-08-31 23:21:54,640 INFO L131 PetriNetUnfolder]: For 26869/27222 co-relation queries the response was YES. [2023-08-31 23:21:54,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24732 conditions, 4395 events. 2784/4395 cut-off events. For 26869/27222 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24208 event pairs, 245 based on Foata normal form. 199/4509 useless extension candidates. Maximal degree in co-relation 24706. Up to 2029 conditions per place. [2023-08-31 23:21:54,661 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 114 selfloop transitions, 40 changer transitions 72/232 dead transitions. [2023-08-31 23:21:54,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 232 transitions, 2718 flow [2023-08-31 23:21:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-31 23:21:54,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595152140278494 [2023-08-31 23:21:54,664 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-31 23:21:54,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-31 23:21:54,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:54,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-31 23:21:54,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,670 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,671 INFO L175 Difference]: Start difference. First operand has 80 places, 99 transitions, 1046 flow. Second operand 7 states and 891 transitions. [2023-08-31 23:21:54,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 232 transitions, 2718 flow [2023-08-31 23:21:54,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 232 transitions, 2596 flow, removed 30 selfloop flow, removed 3 redundant places. [2023-08-31 23:21:54,811 INFO L231 Difference]: Finished difference. Result has 86 places, 99 transitions, 1102 flow [2023-08-31 23:21:54,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1102, PETRI_PLACES=86, PETRI_TRANSITIONS=99} [2023-08-31 23:21:54,812 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2023-08-31 23:21:54,812 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 99 transitions, 1102 flow [2023-08-31 23:21:54,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:54,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:54,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:21:54,813 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-31 23:21:54,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1908185593, now seen corresponding path program 2 times [2023-08-31 23:21:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:54,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10751262] [2023-08-31 23:21:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:55,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10751262] [2023-08-31 23:21:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10751262] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397550667] [2023-08-31 23:21:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:55,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:55,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:55,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:21:55,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 99 transitions, 1102 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:55,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:21:55,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:55,418 INFO L130 PetriNetUnfolder]: 1668/2719 cut-off events. [2023-08-31 23:21:55,418 INFO L131 PetriNetUnfolder]: For 18089/18683 co-relation queries the response was YES. [2023-08-31 23:21:55,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14569 conditions, 2719 events. 1668/2719 cut-off events. For 18089/18683 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 15855 event pairs, 177 based on Foata normal form. 401/2993 useless extension candidates. Maximal degree in co-relation 14540. Up to 1078 conditions per place. [2023-08-31 23:21:55,435 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 80 selfloop transitions, 17 changer transitions 69/179 dead transitions. [2023-08-31 23:21:55,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 179 transitions, 2369 flow [2023-08-31 23:21:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions. [2023-08-31 23:21:55,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48676293622142 [2023-08-31 23:21:55,438 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions. [2023-08-31 23:21:55,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions. [2023-08-31 23:21:55,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:55,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions. [2023-08-31 23:21:55,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,444 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,444 INFO L175 Difference]: Start difference. First operand has 86 places, 99 transitions, 1102 flow. Second operand 6 states and 809 transitions. [2023-08-31 23:21:55,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 179 transitions, 2369 flow [2023-08-31 23:21:55,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 179 transitions, 2250 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-08-31 23:21:55,516 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 677 flow [2023-08-31 23:21:55,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=677, PETRI_PLACES=86, PETRI_TRANSITIONS=66} [2023-08-31 23:21:55,517 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2023-08-31 23:21:55,517 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 677 flow [2023-08-31 23:21:55,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:55,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:55,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:21:55,519 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-31 23:21:55,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash 605017354, now seen corresponding path program 1 times [2023-08-31 23:21:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751283523] [2023-08-31 23:21:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751283523] [2023-08-31 23:21:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751283523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:56,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:56,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458394415] [2023-08-31 23:21:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:56,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:56,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:56,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:56,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-08-31 23:21:56,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 677 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:56,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-08-31 23:21:56,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:56,604 INFO L130 PetriNetUnfolder]: 488/862 cut-off events. [2023-08-31 23:21:56,604 INFO L131 PetriNetUnfolder]: For 5513/5526 co-relation queries the response was YES. [2023-08-31 23:21:56,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4978 conditions, 862 events. 488/862 cut-off events. For 5513/5526 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3939 event pairs, 51 based on Foata normal form. 14/870 useless extension candidates. Maximal degree in co-relation 4951. Up to 471 conditions per place. [2023-08-31 23:21:56,607 INFO L137 encePairwiseOnDemand]: 267/277 looper letters, 51 selfloop transitions, 6 changer transitions 70/129 dead transitions. [2023-08-31 23:21:56,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 129 transitions, 1462 flow [2023-08-31 23:21:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-08-31 23:21:56,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4404332129963899 [2023-08-31 23:21:56,610 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-08-31 23:21:56,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-08-31 23:21:56,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:56,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-08-31 23:21:56,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,615 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,616 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 677 flow. Second operand 7 states and 854 transitions. [2023-08-31 23:21:56,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 129 transitions, 1462 flow [2023-08-31 23:21:56,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 129 transitions, 1061 flow, removed 63 selfloop flow, removed 20 redundant places. [2023-08-31 23:21:56,629 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 277 flow [2023-08-31 23:21:56,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2023-08-31 23:21:56,630 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-31 23:21:56,630 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 277 flow [2023-08-31 23:21:56,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:56,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:56,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:21:56,631 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-31 23:21:56,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -553090040, now seen corresponding path program 2 times [2023-08-31 23:21:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511551090] [2023-08-31 23:21:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:21:56,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:21:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:21:56,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:21:56,737 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:21:56,738 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:21:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:21:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:21:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:21:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:21:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:21:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:21:56,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:21:56,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:21:56,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:21:56,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:21:56,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:21:56,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:21:56,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:21:56,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:21:56,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:21:56,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:21:56,742 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:56,747 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:21:56,747 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:21:56,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:21:56 BasicIcfg [2023-08-31 23:21:56,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:21:56,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:21:56,808 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:21:56,808 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:21:56,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:28" (3/4) ... [2023-08-31 23:21:56,810 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:21:56,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:21:56,811 INFO L158 Benchmark]: Toolchain (without parser) took 29412.80ms. Allocated memory was 65.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 44.4MB in the beginning and 957.9MB in the end (delta: -913.6MB). Peak memory consumption was 408.5MB. Max. memory is 16.1GB. [2023-08-31 23:21:56,811 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 42.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:21:56,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.39ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 44.2MB in the beginning and 65.2MB in the end (delta: -21.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2023-08-31 23:21:56,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.26ms. Allocated memory is still 94.4MB. Free memory was 65.2MB in the beginning and 62.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:21:56,812 INFO L158 Benchmark]: Boogie Preprocessor took 62.89ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 60.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:21:56,812 INFO L158 Benchmark]: RCFGBuilder took 736.80ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 49.6MB in the end (delta: 10.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-08-31 23:21:56,812 INFO L158 Benchmark]: TraceAbstraction took 28034.53ms. Allocated memory was 94.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 49.2MB in the beginning and 959.0MB in the end (delta: -909.8MB). Peak memory consumption was 382.0MB. Max. memory is 16.1GB. [2023-08-31 23:21:56,813 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 1.4GB. Free memory was 959.0MB in the beginning and 957.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:21:56,814 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 42.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.39ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 44.2MB in the beginning and 65.2MB in the end (delta: -21.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.26ms. Allocated memory is still 94.4MB. Free memory was 65.2MB in the beginning and 62.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.89ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 60.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.80ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 49.6MB in the end (delta: 10.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28034.53ms. Allocated memory was 94.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 49.2MB in the beginning and 959.0MB in the end (delta: -909.8MB). Peak memory consumption was 382.0MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 1.4GB. Free memory was 959.0MB in the beginning and 957.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 149 PlacesBefore, 52 PlacesAfterwards, 138 TransitionsBefore, 40 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 8840 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4682, independent: 4463, independent conditional: 0, independent unconditional: 4463, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1745, independent: 1708, independent conditional: 0, independent unconditional: 1708, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4682, independent: 2755, independent conditional: 0, independent unconditional: 2755, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1745, unknown conditional: 0, unknown unconditional: 1745] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-1, t1165={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] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=0, t1165={5:0}, t1166={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] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=1, t1165={5:0}, t1166={6:0}, t1167={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] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=2, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L788] 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) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 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 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L824] 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) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 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 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 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}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 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 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3: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=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 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) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 847]: 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: 851]: 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, 178 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: 27.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1042 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 818 mSDsluCounter, 588 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 449 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2435 IncrementalHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 139 mSDtfsCounter, 2435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1142occurred in iteration=8, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 2170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:21:56,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044.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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:21:58,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:21:58,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:21:58,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:21:58,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:21:58,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:21:58,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:21:58,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:21:58,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:21:58,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:21:58,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:21:58,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:21:58,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:21:58,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:21:58,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:21:58,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:21:58,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:21:58,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:21:58,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:21:58,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:21:58,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:21:58,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:21:58,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:21:58,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:21:58,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:21:58,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:21:58,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:21:58,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:21:58,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:21:58,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:21:58,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:21:58,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:21:58,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:21:58,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:21:58,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:21:58,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:21:58,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:21:58,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:21:58,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:21:58,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:21:58,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:21:58,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:21:58,880 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:21:58,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:21:58,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:21:58,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:21:58,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:21:58,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:21:58,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:21:58,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:21:58,883 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:21:58,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:21:58,883 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:21:58,883 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:21:58,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:21:58,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:21:58,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:21:58,884 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:21:58,884 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:21:58,884 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:21:58,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:21:58,885 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:21:58,885 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:21:58,885 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:21:58,885 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:21:58,885 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:21:58,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:21:58,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:21:58,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:21:58,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:21:58,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:21:58,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:21:58,887 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:21:58,887 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:21:58,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:21:58,887 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:21:58,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:21:58,888 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:21:58,888 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:21:58,888 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:21:59,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:21:59,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:21:59,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:21:59,194 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:21:59,194 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:21:59,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-08-31 23:22:00,244 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:22:00,483 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:22:00,484 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-08-31 23:22:00,494 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c9bdedf/f3b32318f73240baa82afb39a8087a62/FLAGb52e15180 [2023-08-31 23:22:00,509 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c9bdedf/f3b32318f73240baa82afb39a8087a62 [2023-08-31 23:22:00,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:22:00,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:22:00,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:22:00,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:22:00,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:22:00,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:22:00" (1/1) ... [2023-08-31 23:22:00,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bae38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:00, skipping insertion in model container [2023-08-31 23:22:00,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:22:00" (1/1) ... [2023-08-31 23:22:00,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:22:00,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:22:00,683 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/mix044.opt.i[944,957] [2023-08-31 23:22:00,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:22:00,928 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:22:00,940 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/mix044.opt.i[944,957] [2023-08-31 23:22:00,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:22:01,041 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:22:01,042 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:22:01,047 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:22:01,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01 WrapperNode [2023-08-31 23:22:01,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:22:01,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:22:01,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:22:01,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:22:01,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,112 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2023-08-31 23:22:01,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:22:01,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:22:01,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:22:01,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:22:01,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:22:01,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:22:01,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:22:01,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:22:01,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (1/1) ... [2023-08-31 23:22:01,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:22:01,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:22:01,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:22:01,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:22:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:22:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:22:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:22:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:22:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:22:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:22:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:22:01,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:22:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:22:01,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:22:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:22:01,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:22:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:22:01,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:22:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:22:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:22:01,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:22:01,269 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:22:01,480 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:22:01,482 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:22:01,874 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:22:01,979 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:22:01,979 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:22:01,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:22:01 BoogieIcfgContainer [2023-08-31 23:22:01,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:22:01,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:22:01,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:22:01,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:22:01,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:22:00" (1/3) ... [2023-08-31 23:22:01,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfa0210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:22:01, skipping insertion in model container [2023-08-31 23:22:01,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:01" (2/3) ... [2023-08-31 23:22:01,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfa0210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:22:01, skipping insertion in model container [2023-08-31 23:22:01,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:22:01" (3/3) ... [2023-08-31 23:22:01,988 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2023-08-31 23:22:02,002 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:22:02,003 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:22:02,003 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:22:02,069 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:22:02,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:22:02,185 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:22:02,186 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:22:02,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:22:02,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:22:02,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-31 23:22:02,201 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:22:02,216 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:22:02,219 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:22:02,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-31 23:22:02,272 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:22:02,273 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:22:02,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:22:02,277 INFO L119 LiptonReduction]: Number of co-enabled transitions 3258 [2023-08-31 23:22:09,003 INFO L134 LiptonReduction]: Checked pairs total: 8882 [2023-08-31 23:22:09,003 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-31 23:22:09,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:22:09,026 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;@6e716f73, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:22:09,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:22:09,027 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:22:09,028 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:22:09,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:09,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:22:09,029 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-31 23:22:09,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash 586, now seen corresponding path program 1 times [2023-08-31 23:22:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:09,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973315747] [2023-08-31 23:22:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:09,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:09,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:09,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-31 23:22:09,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:22:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:09,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:22:09,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:09,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:09,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973315747] [2023-08-31 23:22:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973315747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:09,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:22:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270910852] [2023-08-31 23:22:09,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:09,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:22:09,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:22:09,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:22:09,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 275 [2023-08-31 23:22:09,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:09,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:09,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 275 [2023-08-31 23:22:09,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:09,972 INFO L130 PetriNetUnfolder]: 4151/5767 cut-off events. [2023-08-31 23:22:09,973 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-31 23:22:09,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11559 conditions, 5767 events. 4151/5767 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 29862 event pairs, 4151 based on Foata normal form. 180/4998 useless extension candidates. Maximal degree in co-relation 11547. Up to 5689 conditions per place. [2023-08-31 23:22:10,010 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:22:10,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-08-31 23:22:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:22:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:22:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-31 23:22:10,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2023-08-31 23:22:10,022 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-31 23:22:10,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-31 23:22:10,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:10,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-31 23:22:10,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:10,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 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-31 23:22:10,033 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 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-31 23:22:10,035 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 295 transitions. [2023-08-31 23:22:10,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-08-31 23:22:10,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:22:10,039 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:22:10,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:22:10,044 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:22:10,044 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:22:10,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:10,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:10,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:10,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-31 23:22:10,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:10,254 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-31 23:22:10,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash 945682723, now seen corresponding path program 1 times [2023-08-31 23:22:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078788126] [2023-08-31 23:22:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:10,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:10,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:10,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:10,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:22:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:10,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:22:10,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:10,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:10,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:10,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078788126] [2023-08-31 23:22:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078788126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:10,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:22:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919756948] [2023-08-31 23:22:10,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:10,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:22:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:10,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:22:10,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:22:10,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275 [2023-08-31 23:22:10,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:10,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:10,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275 [2023-08-31 23:22:10,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:10,974 INFO L130 PetriNetUnfolder]: 3299/5149 cut-off events. [2023-08-31 23:22:10,974 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:22:10,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9798 conditions, 5149 events. 3299/5149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31759 event pairs, 743 based on Foata normal form. 0/4704 useless extension candidates. Maximal degree in co-relation 9795. Up to 3421 conditions per place. [2023-08-31 23:22:10,999 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 33 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-31 23:22:10,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 174 flow [2023-08-31 23:22:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:22:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:22:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-31 23:22:11,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175757575757576 [2023-08-31 23:22:11,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-31 23:22:11,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-31 23:22:11,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:11,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-31 23:22:11,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,008 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 427 transitions. [2023-08-31 23:22:11,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 174 flow [2023-08-31 23:22:11,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:22:11,009 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-31 23:22:11,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 23:22:11,010 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:22:11,010 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-31 23:22:11,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:11,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:11,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-31 23:22:11,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:11,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:11,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2146652179, now seen corresponding path program 1 times [2023-08-31 23:22:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94171257] [2023-08-31 23:22:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:11,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:11,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:11,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:22:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:11,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:22:11,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:11,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:11,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94171257] [2023-08-31 23:22:11,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94171257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:11,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:11,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:22:11,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083394116] [2023-08-31 23:22:11,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:11,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:22:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:22:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:22:11,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-31 23:22:11,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:11,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-31 23:22:11,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:11,709 INFO L130 PetriNetUnfolder]: 1763/2581 cut-off events. [2023-08-31 23:22:11,709 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-31 23:22:11,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5384 conditions, 2581 events. 1763/2581 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12840 event pairs, 413 based on Foata normal form. 36/2496 useless extension candidates. Maximal degree in co-relation 5380. Up to 2373 conditions per place. [2023-08-31 23:22:11,723 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 34 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-08-31 23:22:11,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 186 flow [2023-08-31 23:22:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:22:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:22:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-31 23:22:11,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2023-08-31 23:22:11,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-31 23:22:11,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-31 23:22:11,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:11,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-31 23:22:11,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,733 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 3 states and 415 transitions. [2023-08-31 23:22:11,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 186 flow [2023-08-31 23:22:11,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:22:11,736 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 97 flow [2023-08-31 23:22:11,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-31 23:22:11,737 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:22:11,737 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 97 flow [2023-08-31 23:22:11,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:11,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:11,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-31 23:22:11,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:11,951 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-31 23:22:11,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash -160210939, now seen corresponding path program 1 times [2023-08-31 23:22:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:11,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826118145] [2023-08-31 23:22:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:11,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:11,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:11,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:11,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:22:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:12,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:22:12,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:12,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:12,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826118145] [2023-08-31 23:22:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826118145] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:12,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:12,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:22:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615303801] [2023-08-31 23:22:12,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:12,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:22:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:12,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:22:12,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:22:12,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-31 23:22:12,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:12,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:12,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-31 23:22:12,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:12,364 INFO L130 PetriNetUnfolder]: 863/1381 cut-off events. [2023-08-31 23:22:12,364 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2023-08-31 23:22:12,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3397 conditions, 1381 events. 863/1381 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6502 event pairs, 160 based on Foata normal form. 60/1380 useless extension candidates. Maximal degree in co-relation 3392. Up to 883 conditions per place. [2023-08-31 23:22:12,374 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 44 selfloop transitions, 9 changer transitions 0/58 dead transitions. [2023-08-31 23:22:12,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 273 flow [2023-08-31 23:22:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:22:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:22:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-31 23:22:12,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036363636363637 [2023-08-31 23:22:12,377 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-31 23:22:12,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-31 23:22:12,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:12,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-31 23:22:12,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:12,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:12,382 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:12,382 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 97 flow. Second operand 4 states and 554 transitions. [2023-08-31 23:22:12,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 273 flow [2023-08-31 23:22:12,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:22:12,385 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 144 flow [2023-08-31 23:22:12,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-31 23:22:12,386 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-08-31 23:22:12,386 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 144 flow [2023-08-31 23:22:12,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:12,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:12,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:12,399 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-31 23:22:12,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:12,597 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-31 23:22:12,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1605027561, now seen corresponding path program 1 times [2023-08-31 23:22:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472689147] [2023-08-31 23:22:12,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:12,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:12,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:12,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:22:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:12,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:22:12,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:12,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-31 23:22:12,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:12,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:12,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472689147] [2023-08-31 23:22:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472689147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:22:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442855454] [2023-08-31 23:22:12,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:12,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:22:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:12,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:22:12,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:22:12,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-31 23:22:12,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:12,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:12,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-31 23:22:12,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:13,035 INFO L130 PetriNetUnfolder]: 493/826 cut-off events. [2023-08-31 23:22:13,035 INFO L131 PetriNetUnfolder]: For 600/600 co-relation queries the response was YES. [2023-08-31 23:22:13,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 826 events. 493/826 cut-off events. For 600/600 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3540 event pairs, 104 based on Foata normal form. 37/839 useless extension candidates. Maximal degree in co-relation 2379. Up to 290 conditions per place. [2023-08-31 23:22:13,041 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2023-08-31 23:22:13,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 370 flow [2023-08-31 23:22:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:22:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:22:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-31 23:22:13,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025454545454545 [2023-08-31 23:22:13,044 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-31 23:22:13,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-31 23:22:13,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:13,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-31 23:22:13,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,049 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,049 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 144 flow. Second operand 5 states and 691 transitions. [2023-08-31 23:22:13,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 370 flow [2023-08-31 23:22:13,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 352 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:22:13,053 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 194 flow [2023-08-31 23:22:13,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-31 23:22:13,054 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-31 23:22:13,054 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 194 flow [2023-08-31 23:22:13,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:13,054 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] [2023-08-31 23:22:13,067 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-31 23:22:13,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:13,268 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-31 23:22:13,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1319908580, now seen corresponding path program 1 times [2023-08-31 23:22:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:13,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123359728] [2023-08-31 23:22:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:13,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:13,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:13,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:13,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:22:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:13,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:22:13,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:13,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:13,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:13,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123359728] [2023-08-31 23:22:13,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123359728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:13,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:13,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:22:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314116304] [2023-08-31 23:22:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:13,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:22:13,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:13,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:22:13,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:22:13,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-31 23:22:13,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:13,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-31 23:22:13,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:13,743 INFO L130 PetriNetUnfolder]: 443/726 cut-off events. [2023-08-31 23:22:13,743 INFO L131 PetriNetUnfolder]: For 694/694 co-relation queries the response was YES. [2023-08-31 23:22:13,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 726 events. 443/726 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3092 event pairs, 99 based on Foata normal form. 10/722 useless extension candidates. Maximal degree in co-relation 2192. Up to 290 conditions per place. [2023-08-31 23:22:13,749 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 48 selfloop transitions, 17 changer transitions 0/70 dead transitions. [2023-08-31 23:22:13,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 396 flow [2023-08-31 23:22:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:22:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:22:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2023-08-31 23:22:13,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49454545454545457 [2023-08-31 23:22:13,752 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 816 transitions. [2023-08-31 23:22:13,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 816 transitions. [2023-08-31 23:22:13,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:13,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 816 transitions. [2023-08-31 23:22:13,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,758 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,758 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 194 flow. Second operand 6 states and 816 transitions. [2023-08-31 23:22:13,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 396 flow [2023-08-31 23:22:13,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 362 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-31 23:22:13,765 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 204 flow [2023-08-31 23:22:13,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-31 23:22:13,766 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-31 23:22:13,766 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 204 flow [2023-08-31 23:22:13,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:13,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:13,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:13,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:13,983 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-31 23:22:13,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2020876120, now seen corresponding path program 1 times [2023-08-31 23:22:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214807862] [2023-08-31 23:22:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:13,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:13,985 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:13,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:22:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:14,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:22:14,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:14,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:14,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:14,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214807862] [2023-08-31 23:22:14,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214807862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:14,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:14,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:22:14,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700552312] [2023-08-31 23:22:14,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:14,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:22:14,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:14,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:22:14,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:22:14,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-31 23:22:14,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:14,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-31 23:22:14,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:14,684 INFO L130 PetriNetUnfolder]: 632/1041 cut-off events. [2023-08-31 23:22:14,684 INFO L131 PetriNetUnfolder]: For 1448/1448 co-relation queries the response was YES. [2023-08-31 23:22:14,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1041 events. 632/1041 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4857 event pairs, 127 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 3241. Up to 571 conditions per place. [2023-08-31 23:22:14,694 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 78 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2023-08-31 23:22:14,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 625 flow [2023-08-31 23:22:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:22:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:22:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-31 23:22:14,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49236363636363634 [2023-08-31 23:22:14,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-31 23:22:14,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-31 23:22:14,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:14,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-31 23:22:14,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,701 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 204 flow. Second operand 5 states and 677 transitions. [2023-08-31 23:22:14,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 625 flow [2023-08-31 23:22:14,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 512 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-31 23:22:14,711 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 175 flow [2023-08-31 23:22:14,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-31 23:22:14,712 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:22:14,712 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 175 flow [2023-08-31 23:22:14,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:14,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:14,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:14,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:14,923 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:14,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1186551923, now seen corresponding path program 1 times [2023-08-31 23:22:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:14,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704055110] [2023-08-31 23:22:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:14,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:14,926 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:14,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:22:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:15,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:22:15,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:15,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:15,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:15,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704055110] [2023-08-31 23:22:15,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704055110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:15,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:15,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:22:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507428925] [2023-08-31 23:22:15,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:15,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:22:15,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:15,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:22:15,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:22:16,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 275 [2023-08-31 23:22:16,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:16,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:16,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 275 [2023-08-31 23:22:16,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:16,588 INFO L130 PetriNetUnfolder]: 569/941 cut-off events. [2023-08-31 23:22:16,588 INFO L131 PetriNetUnfolder]: For 929/929 co-relation queries the response was YES. [2023-08-31 23:22:16,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 941 events. 569/941 cut-off events. For 929/929 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4433 event pairs, 131 based on Foata normal form. 2/928 useless extension candidates. Maximal degree in co-relation 2755. Up to 760 conditions per place. [2023-08-31 23:22:16,593 INFO L137 encePairwiseOnDemand]: 270/275 looper letters, 39 selfloop transitions, 4 changer transitions 14/62 dead transitions. [2023-08-31 23:22:16,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 392 flow [2023-08-31 23:22:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:22:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:22:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2023-08-31 23:22:16,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218181818181818 [2023-08-31 23:22:16,597 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2023-08-31 23:22:16,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2023-08-31 23:22:16,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:16,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2023-08-31 23:22:16,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:16,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:16,602 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:16,602 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 175 flow. Second operand 6 states and 696 transitions. [2023-08-31 23:22:16,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 392 flow [2023-08-31 23:22:16,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:22:16,610 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 168 flow [2023-08-31 23:22:16,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-08-31 23:22:16,610 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-31 23:22:16,611 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 168 flow [2023-08-31 23:22:16,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:16,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:16,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:16,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:16,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:16,823 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-31 23:22:16,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 779628904, now seen corresponding path program 2 times [2023-08-31 23:22:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:16,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109290829] [2023-08-31 23:22:16,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:22:16,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:16,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:16,825 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:16,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:22:16,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:22:16,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:22:16,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:22:16,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:16,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:16,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109290829] [2023-08-31 23:22:16,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109290829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:16,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:16,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:22:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469486347] [2023-08-31 23:22:16,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:16,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:22:16,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:17,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:22:17,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:22:17,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 275 [2023-08-31 23:22:17,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:17,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 275 [2023-08-31 23:22:17,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:17,221 INFO L130 PetriNetUnfolder]: 840/1402 cut-off events. [2023-08-31 23:22:17,221 INFO L131 PetriNetUnfolder]: For 1114/1114 co-relation queries the response was YES. [2023-08-31 23:22:17,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4099 conditions, 1402 events. 840/1402 cut-off events. For 1114/1114 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7438 event pairs, 398 based on Foata normal form. 1/1383 useless extension candidates. Maximal degree in co-relation 4088. Up to 816 conditions per place. [2023-08-31 23:22:17,229 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 45 selfloop transitions, 2 changer transitions 18/69 dead transitions. [2023-08-31 23:22:17,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 436 flow [2023-08-31 23:22:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:22:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:22:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-08-31 23:22:17,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49636363636363634 [2023-08-31 23:22:17,232 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-08-31 23:22:17,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-08-31 23:22:17,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:17,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-08-31 23:22:17,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,236 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,236 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 168 flow. Second operand 4 states and 546 transitions. [2023-08-31 23:22:17,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 436 flow [2023-08-31 23:22:17,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 418 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:22:17,246 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 167 flow [2023-08-31 23:22:17,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-31 23:22:17,247 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:22:17,248 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 167 flow [2023-08-31 23:22:17,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:17,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:17,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:17,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:17,458 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-31 23:22:17,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash -855234930, now seen corresponding path program 3 times [2023-08-31 23:22:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241031155] [2023-08-31 23:22:17,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:22:17,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:17,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:17,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:22:17,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:22:17,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:22:17,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:22:17,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:17,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:17,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:17,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241031155] [2023-08-31 23:22:17,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241031155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:17,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:17,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:22:17,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263467337] [2023-08-31 23:22:17,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:17,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:22:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:17,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:22:17,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:22:17,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-31 23:22:17,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:17,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-31 23:22:17,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:17,875 INFO L130 PetriNetUnfolder]: 569/1006 cut-off events. [2023-08-31 23:22:17,875 INFO L131 PetriNetUnfolder]: For 853/853 co-relation queries the response was YES. [2023-08-31 23:22:17,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3087 conditions, 1006 events. 569/1006 cut-off events. For 853/853 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4893 event pairs, 73 based on Foata normal form. 1/1004 useless extension candidates. Maximal degree in co-relation 3076. Up to 514 conditions per place. [2023-08-31 23:22:17,879 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 44 selfloop transitions, 1 changer transitions 30/79 dead transitions. [2023-08-31 23:22:17,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 510 flow [2023-08-31 23:22:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:22:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:22:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-31 23:22:17,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488 [2023-08-31 23:22:17,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-31 23:22:17,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-31 23:22:17,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:17,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-31 23:22:17,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,886 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,887 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 167 flow. Second operand 5 states and 671 transitions. [2023-08-31 23:22:17,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 510 flow [2023-08-31 23:22:17,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 498 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:22:17,893 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 168 flow [2023-08-31 23:22:17,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-08-31 23:22:17,893 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-31 23:22:17,894 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 168 flow [2023-08-31 23:22:17,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:17,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:17,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:17,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:18,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:18,104 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-31 23:22:18,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1116573960, now seen corresponding path program 4 times [2023-08-31 23:22:18,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:18,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97445458] [2023-08-31 23:22:18,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:22:18,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:18,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:18,106 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:18,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:22:18,221 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:22:18,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:22:18,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 23:22:18,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:22:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:22:18,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:22:18,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:22:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97445458] [2023-08-31 23:22:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97445458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:18,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:22:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207610150] [2023-08-31 23:22:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:18,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:22:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:22:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:22:18,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:22:18,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 275 [2023-08-31 23:22:18,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 168 flow. Second operand has 9 states, 9 states have (on average 126.55555555555556) internal successors, (1139), 9 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:18,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:18,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 275 [2023-08-31 23:22:18,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:18,800 INFO L130 PetriNetUnfolder]: 559/1004 cut-off events. [2023-08-31 23:22:18,800 INFO L131 PetriNetUnfolder]: For 1155/1157 co-relation queries the response was YES. [2023-08-31 23:22:18,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 1004 events. 559/1004 cut-off events. For 1155/1157 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4858 event pairs, 126 based on Foata normal form. 1/994 useless extension candidates. Maximal degree in co-relation 3029. Up to 384 conditions per place. [2023-08-31 23:22:18,803 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 42 selfloop transitions, 3 changer transitions 29/78 dead transitions. [2023-08-31 23:22:18,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 508 flow [2023-08-31 23:22:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:22:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:22:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2023-08-31 23:22:18,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781818181818182 [2023-08-31 23:22:18,806 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 789 transitions. [2023-08-31 23:22:18,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions. [2023-08-31 23:22:18,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:18,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions. [2023-08-31 23:22:18,809 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-31 23:22:18,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:18,811 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:18,812 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 168 flow. Second operand 6 states and 789 transitions. [2023-08-31 23:22:18,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 508 flow [2023-08-31 23:22:18,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 500 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:22:18,818 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 178 flow [2023-08-31 23:22:18,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2023-08-31 23:22:18,818 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-31 23:22:18,819 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 178 flow [2023-08-31 23:22:18,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.55555555555556) internal successors, (1139), 9 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:18,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:18,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:18,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:19,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:19,029 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-31 23:22:19,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1877597322, now seen corresponding path program 5 times [2023-08-31 23:22:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661473119] [2023-08-31 23:22:19,030 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:22:19,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:19,031 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:19,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:22:19,158 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:22:19,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:22:19,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:22:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:22:19,304 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:22:19,304 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:22:19,305 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:22:19,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:22:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:22:19,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:22:19,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:22:19,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:22:19,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:22:19,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:22:19,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:19,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:19,519 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:19,523 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:22:19,523 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:22:19,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:22:19 BasicIcfg [2023-08-31 23:22:19,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:22:19,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:22:19,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:22:19,611 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:22:19,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:22:01" (3/4) ... [2023-08-31 23:22:19,613 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:22:19,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:22:19,614 INFO L158 Benchmark]: Toolchain (without parser) took 19101.49ms. Allocated memory was 86.0MB in the beginning and 492.8MB in the end (delta: 406.8MB). Free memory was 62.8MB in the beginning and 351.0MB in the end (delta: -288.2MB). Peak memory consumption was 121.1MB. Max. memory is 16.1GB. [2023-08-31 23:22:19,614 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 69.2MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:22:19,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.20ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.2MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-08-31 23:22:19,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.34ms. Allocated memory is still 86.0MB. Free memory was 60.4MB in the beginning and 57.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:22:19,615 INFO L158 Benchmark]: Boogie Preprocessor took 63.99ms. Allocated memory is still 86.0MB. Free memory was 57.7MB in the beginning and 55.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:22:19,615 INFO L158 Benchmark]: RCFGBuilder took 797.23ms. Allocated memory is still 86.0MB. Free memory was 55.2MB in the beginning and 60.3MB in the end (delta: -5.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-08-31 23:22:19,615 INFO L158 Benchmark]: TraceAbstraction took 17626.86ms. Allocated memory was 86.0MB in the beginning and 492.8MB in the end (delta: 406.8MB). Free memory was 59.8MB in the beginning and 351.0MB in the end (delta: -291.1MB). Peak memory consumption was 116.0MB. Max. memory is 16.1GB. [2023-08-31 23:22:19,615 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 492.8MB. Free memory is still 351.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:22:19,617 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.16ms. Allocated memory is still 69.2MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.20ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.2MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.34ms. Allocated memory is still 86.0MB. Free memory was 60.4MB in the beginning and 57.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.99ms. Allocated memory is still 86.0MB. Free memory was 57.7MB in the beginning and 55.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 797.23ms. Allocated memory is still 86.0MB. Free memory was 55.2MB in the beginning and 60.3MB in the end (delta: -5.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17626.86ms. Allocated memory was 86.0MB in the beginning and 492.8MB in the end (delta: 406.8MB). Free memory was 59.8MB in the beginning and 351.0MB in the end (delta: -291.1MB). Peak memory consumption was 116.0MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 492.8MB. Free memory is still 351.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 150 PlacesBefore, 52 PlacesAfterwards, 139 TransitionsBefore, 40 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 8882 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4369, independent: 4150, independent conditional: 0, independent unconditional: 4150, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1706, independent: 1672, independent conditional: 0, independent unconditional: 1672, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4369, independent: 2478, independent conditional: 0, independent unconditional: 2478, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 1706, unknown conditional: 0, unknown unconditional: 1706] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-1, t1165={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] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=0, t1165={3:0}, t1166={-2147483641: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] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=1, t1165={3:0}, t1166={-2147483641:0}, t1167={-2147483645: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] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=2, t1165={3:0}, t1166={-2147483641:0}, t1167={-2147483645:0}, t1168={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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L788] 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) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 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 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L824] 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) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 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 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 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 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={3:0}, t1166={-2147483641:0}, t1167={-2147483645:0}, t1168={7: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=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 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) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 847]: 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: 851]: 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, 179 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.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1582 IncrementalHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 15 mSDtfsCounter, 1582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=6, InterpolantAutomatonStates: 49, 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.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 201 ConstructedInterpolants, 22 QuantifiedInterpolants, 1961 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1714 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:22:19,636 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