/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:04:49,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:04:49,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:04:49,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:04:49,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:04:49,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:04:49,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:04:49,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:04:49,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:04:49,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:04:49,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:04:49,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:04:49,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:04:49,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:04:49,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:04:49,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:04:49,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:04:49,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:04:49,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:04:49,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:04:49,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:04:49,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:04:49,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:04:49,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:04:49,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:04:49,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:04:49,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:04:49,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:04:49,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:04:49,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:04:49,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:04:49,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:04:49,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:04:49,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:04:49,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:04:49,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:04:49,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:04:49,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:04:49,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:04:49,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:04:49,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:04:49,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:04:49,887 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:04:49,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:04:49,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:04:49,901 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:04:49,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:04:49,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:04:49,903 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:04:49,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:04:49,903 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:04:49,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:04:49,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:04:49,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:04:49,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:04:49,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:04:49,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:04:49,904 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:04:49,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:04:49,904 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:04:49,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:04:49,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:04:49,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:04:49,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:04:49,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:04:49,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:04:49,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:04:49,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:04:49,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:04:49,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:04:49,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:04:49,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:04:49,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:04:49,906 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 18:04:50,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:04:50,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:04:50,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:04:50,289 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:04:50,290 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:04:50,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-01-27 18:04:51,700 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:04:52,100 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:04:52,100 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-01-27 18:04:52,128 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a49456c0/cf43e710863d4c6283d3f4d3811cda90/FLAG888e88e6e [2023-01-27 18:04:52,155 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a49456c0/cf43e710863d4c6283d3f4d3811cda90 [2023-01-27 18:04:52,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:04:52,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:04:52,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:04:52,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:04:52,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:04:52,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:52,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ceefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52, skipping insertion in model container [2023-01-27 18:04:52,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:52,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:04:52,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:04:52,506 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/mix007.oepc.i[945,958] [2023-01-27 18:04:52,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:04:52,812 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:04:52,826 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/mix007.oepc.i[945,958] [2023-01-27 18:04:52,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:04:52,969 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:04:52,969 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:04:52,990 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:04:52,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52 WrapperNode [2023-01-27 18:04:52,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:04:52,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:04:52,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:04:52,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:04:52,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,081 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-01-27 18:04:53,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:04:53,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:04:53,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:04:53,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:04:53,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,144 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:04:53,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:04:53,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:04:53,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:04:53,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (1/1) ... [2023-01-27 18:04:53,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:04:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:04:53,242 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-01-27 18:04:53,301 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-01-27 18:04:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:04:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:04:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:04:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:04:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:04:53,328 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:04:53,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:04:53,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:04:53,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:04:53,328 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:04:53,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:04:53,328 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:04:53,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:04:53,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:04:53,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:04:53,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:04:53,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:04:53,330 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:04:53,542 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:04:53,560 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:04:54,216 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:04:54,430 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:04:54,431 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:04:54,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:04:54 BoogieIcfgContainer [2023-01-27 18:04:54,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:04:54,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:04:54,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:04:54,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:04:54,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:04:52" (1/3) ... [2023-01-27 18:04:54,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2d14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:04:54, skipping insertion in model container [2023-01-27 18:04:54,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:52" (2/3) ... [2023-01-27 18:04:54,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2d14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:04:54, skipping insertion in model container [2023-01-27 18:04:54,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:04:54" (3/3) ... [2023-01-27 18:04:54,447 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.oepc.i [2023-01-27 18:04:54,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:04:54,460 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:04:54,460 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:04:54,569 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:04:54,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-01-27 18:04:54,723 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-27 18:04:54,724 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:04:54,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-27 18:04:54,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-01-27 18:04:54,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-01-27 18:04:54,747 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:04:54,775 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-27 18:04:54,778 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-27 18:04:54,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-01-27 18:04:54,829 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-27 18:04:54,829 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:04:54,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-27 18:04:54,840 INFO L119 LiptonReduction]: Number of co-enabled transitions 3286 [2023-01-27 18:05:00,108 INFO L134 LiptonReduction]: Checked pairs total: 9535 [2023-01-27 18:05:00,108 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-27 18:05:00,123 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:05:00,129 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=LoopsAndPotentialCycles, 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;@4994cad0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:05:00,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:05:00,147 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-27 18:05:00,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:05:00,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:00,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:05:00,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:00,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 554491, now seen corresponding path program 1 times [2023-01-27 18:05:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:00,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508886996] [2023-01-27 18:05:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508886996] [2023-01-27 18:05:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508886996] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:00,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:00,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:05:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997406596] [2023-01-27 18:05:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:00,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:05:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:00,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:05:00,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:05:00,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-01-27 18:05:00,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:00,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:00,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-01-27 18:05:00,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:02,267 INFO L130 PetriNetUnfolder]: 4903/6751 cut-off events. [2023-01-27 18:05:02,267 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-01-27 18:05:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13599 conditions, 6751 events. 4903/6751 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33758 event pairs, 2535 based on Foata normal form. 0/6404 useless extension candidates. Maximal degree in co-relation 13587. Up to 5335 conditions per place. [2023-01-27 18:05:02,344 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-01-27 18:05:02,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-01-27 18:05:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:05:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:05:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-01-27 18:05:02,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5495867768595041 [2023-01-27 18:05:02,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-01-27 18:05:02,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-01-27 18:05:02,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:02,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-01-27 18:05:02,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:02,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:02,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:02,397 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 399 transitions. [2023-01-27 18:05:02,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-01-27 18:05:02,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:05:02,417 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-01-27 18:05:02,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-01-27 18:05:02,421 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-01-27 18:05:02,421 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-01-27 18:05:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:02,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:02,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:02,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:05:02,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:02,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1210786638, now seen corresponding path program 1 times [2023-01-27 18:05:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:02,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991294292] [2023-01-27 18:05:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991294292] [2023-01-27 18:05:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991294292] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:03,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:03,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:05:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214057070] [2023-01-27 18:05:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:03,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:05:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:03,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:05:03,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:05:03,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-27 18:05:03,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:03,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:03,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-27 18:05:03,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:06,405 INFO L130 PetriNetUnfolder]: 17545/23784 cut-off events. [2023-01-27 18:05:06,405 INFO L131 PetriNetUnfolder]: For 1219/1219 co-relation queries the response was YES. [2023-01-27 18:05:06,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49340 conditions, 23784 events. 17545/23784 cut-off events. For 1219/1219 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 124470 event pairs, 6299 based on Foata normal form. 548/24332 useless extension candidates. Maximal degree in co-relation 49330. Up to 16775 conditions per place. [2023-01-27 18:05:06,852 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-01-27 18:05:06,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 240 flow [2023-01-27 18:05:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:05:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:05:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-01-27 18:05:06,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110192837465565 [2023-01-27 18:05:06,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-01-27 18:05:06,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-01-27 18:05:06,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:06,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-01-27 18:05:06,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:06,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:06,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:06,873 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 371 transitions. [2023-01-27 18:05:06,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 240 flow [2023-01-27 18:05:06,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:05:06,875 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 128 flow [2023-01-27 18:05:06,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-01-27 18:05:06,876 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-01-27 18:05:06,876 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 128 flow [2023-01-27 18:05:06,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:06,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:06,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:06,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:05:06,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:06,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1120321375, now seen corresponding path program 1 times [2023-01-27 18:05:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48500070] [2023-01-27 18:05:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:06,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48500070] [2023-01-27 18:05:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48500070] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:07,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:07,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:05:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191147427] [2023-01-27 18:05:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:07,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:07,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-27 18:05:07,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:07,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:07,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-27 18:05:07,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:10,287 INFO L130 PetriNetUnfolder]: 16209/22000 cut-off events. [2023-01-27 18:05:10,288 INFO L131 PetriNetUnfolder]: For 8433/8433 co-relation queries the response was YES. [2023-01-27 18:05:10,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54442 conditions, 22000 events. 16209/22000 cut-off events. For 8433/8433 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 111186 event pairs, 4613 based on Foata normal form. 280/22280 useless extension candidates. Maximal degree in co-relation 54430. Up to 11031 conditions per place. [2023-01-27 18:05:10,584 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-01-27 18:05:10,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 348 flow [2023-01-27 18:05:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:05:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:05:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-01-27 18:05:10,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496900826446281 [2023-01-27 18:05:10,586 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-01-27 18:05:10,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-01-27 18:05:10,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:10,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-01-27 18:05:10,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:10,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:10,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:10,589 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 128 flow. Second operand 4 states and 481 transitions. [2023-01-27 18:05:10,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 348 flow [2023-01-27 18:05:10,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:05:10,701 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 180 flow [2023-01-27 18:05:10,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-01-27 18:05:10,702 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-01-27 18:05:10,705 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 180 flow [2023-01-27 18:05:10,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:10,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:10,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:10,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:05:10,705 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:10,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -409342910, now seen corresponding path program 1 times [2023-01-27 18:05:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861951324] [2023-01-27 18:05:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:11,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:11,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861951324] [2023-01-27 18:05:11,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861951324] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:11,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:11,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:05:11,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767841868] [2023-01-27 18:05:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:11,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:05:11,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:11,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:05:11,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:05:11,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-01-27 18:05:11,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:11,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:11,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-01-27 18:05:11,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:13,441 INFO L130 PetriNetUnfolder]: 10829/15667 cut-off events. [2023-01-27 18:05:13,441 INFO L131 PetriNetUnfolder]: For 8096/8481 co-relation queries the response was YES. [2023-01-27 18:05:13,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38126 conditions, 15667 events. 10829/15667 cut-off events. For 8096/8481 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 93793 event pairs, 3489 based on Foata normal form. 289/15434 useless extension candidates. Maximal degree in co-relation 38111. Up to 9752 conditions per place. [2023-01-27 18:05:13,653 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 41 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-01-27 18:05:13,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 310 flow [2023-01-27 18:05:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:05:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:05:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-01-27 18:05:13,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2023-01-27 18:05:13,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-01-27 18:05:13,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-01-27 18:05:13,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:13,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-01-27 18:05:13,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:13,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:13,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:13,662 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 180 flow. Second operand 3 states and 385 transitions. [2023-01-27 18:05:13,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 310 flow [2023-01-27 18:05:13,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:05:13,716 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 191 flow [2023-01-27 18:05:13,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=3, PETRI_FLOW=191, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-01-27 18:05:13,733 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-01-27 18:05:13,734 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 191 flow [2023-01-27 18:05:13,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:13,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:13,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:13,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:05:13,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:13,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 185686995, now seen corresponding path program 1 times [2023-01-27 18:05:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765828698] [2023-01-27 18:05:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765828698] [2023-01-27 18:05:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765828698] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:14,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:05:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834212761] [2023-01-27 18:05:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:14,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:14,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:14,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:14,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-01-27 18:05:14,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:14,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:14,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-01-27 18:05:14,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:15,883 INFO L130 PetriNetUnfolder]: 9003/13453 cut-off events. [2023-01-27 18:05:15,883 INFO L131 PetriNetUnfolder]: For 5448/6018 co-relation queries the response was YES. [2023-01-27 18:05:15,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31924 conditions, 13453 events. 9003/13453 cut-off events. For 5448/6018 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 86705 event pairs, 1809 based on Foata normal form. 1112/14040 useless extension candidates. Maximal degree in co-relation 31907. Up to 5487 conditions per place. [2023-01-27 18:05:16,017 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 60 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2023-01-27 18:05:16,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 447 flow [2023-01-27 18:05:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:05:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:05:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-01-27 18:05:16,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515495867768595 [2023-01-27 18:05:16,019 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-01-27 18:05:16,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-01-27 18:05:16,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:16,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-01-27 18:05:16,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:16,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:16,022 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:16,022 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 191 flow. Second operand 4 states and 499 transitions. [2023-01-27 18:05:16,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 447 flow [2023-01-27 18:05:16,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:05:16,042 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 229 flow [2023-01-27 18:05:16,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-01-27 18:05:16,043 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-01-27 18:05:16,043 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 229 flow [2023-01-27 18:05:16,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:16,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:16,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:16,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:05:16,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:16,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1970146418, now seen corresponding path program 1 times [2023-01-27 18:05:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467909768] [2023-01-27 18:05:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:16,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467909768] [2023-01-27 18:05:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467909768] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:16,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:16,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:05:16,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255143667] [2023-01-27 18:05:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:16,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:05:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:05:16,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:05:16,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-01-27 18:05:16,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:16,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:16,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-01-27 18:05:16,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:18,231 INFO L130 PetriNetUnfolder]: 7306/11313 cut-off events. [2023-01-27 18:05:18,231 INFO L131 PetriNetUnfolder]: For 7755/8155 co-relation queries the response was YES. [2023-01-27 18:05:18,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32837 conditions, 11313 events. 7306/11313 cut-off events. For 7755/8155 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 74554 event pairs, 1677 based on Foata normal form. 712/11689 useless extension candidates. Maximal degree in co-relation 32818. Up to 4272 conditions per place. [2023-01-27 18:05:18,299 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 77 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2023-01-27 18:05:18,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 602 flow [2023-01-27 18:05:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:05:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:05:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-01-27 18:05:18,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2023-01-27 18:05:18,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-01-27 18:05:18,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-01-27 18:05:18,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:18,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-01-27 18:05:18,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:18,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:18,342 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:18,342 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 229 flow. Second operand 5 states and 627 transitions. [2023-01-27 18:05:18,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 602 flow [2023-01-27 18:05:18,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:05:18,351 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 294 flow [2023-01-27 18:05:18,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-01-27 18:05:18,353 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-01-27 18:05:18,353 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 294 flow [2023-01-27 18:05:18,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:18,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:18,354 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-01-27 18:05:18,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:05:18,354 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:18,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1989898883, now seen corresponding path program 1 times [2023-01-27 18:05:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:18,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220976244] [2023-01-27 18:05:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:18,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:18,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:18,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220976244] [2023-01-27 18:05:18,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220976244] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:18,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:18,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:05:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745138780] [2023-01-27 18:05:18,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:18,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:18,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:18,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-01-27 18:05:18,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:18,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:18,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-01-27 18:05:18,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:20,642 INFO L130 PetriNetUnfolder]: 12012/18621 cut-off events. [2023-01-27 18:05:20,642 INFO L131 PetriNetUnfolder]: For 31494/31935 co-relation queries the response was YES. [2023-01-27 18:05:20,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63002 conditions, 18621 events. 12012/18621 cut-off events. For 31494/31935 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 128888 event pairs, 4124 based on Foata normal form. 152/18301 useless extension candidates. Maximal degree in co-relation 62980. Up to 9317 conditions per place. [2023-01-27 18:05:20,774 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 73 selfloop transitions, 3 changer transitions 22/109 dead transitions. [2023-01-27 18:05:20,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 811 flow [2023-01-27 18:05:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:05:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:05:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-01-27 18:05:20,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5299586776859504 [2023-01-27 18:05:20,776 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-01-27 18:05:20,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-01-27 18:05:20,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:20,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-01-27 18:05:20,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:20,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:20,781 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:20,781 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 294 flow. Second operand 4 states and 513 transitions. [2023-01-27 18:05:20,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 811 flow [2023-01-27 18:05:20,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 109 transitions, 773 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-01-27 18:05:20,826 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 300 flow [2023-01-27 18:05:20,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-01-27 18:05:20,827 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-01-27 18:05:20,828 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 300 flow [2023-01-27 18:05:20,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:20,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:20,828 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-01-27 18:05:20,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:05:20,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:20,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:20,828 INFO L85 PathProgramCache]: Analyzing trace with hash -942809175, now seen corresponding path program 2 times [2023-01-27 18:05:20,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:20,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614607433] [2023-01-27 18:05:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614607433] [2023-01-27 18:05:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614607433] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:05:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105286694] [2023-01-27 18:05:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:21,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:05:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:21,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:05:21,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:05:21,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-01-27 18:05:21,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:21,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:21,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-01-27 18:05:21,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:23,289 INFO L130 PetriNetUnfolder]: 10128/15782 cut-off events. [2023-01-27 18:05:23,289 INFO L131 PetriNetUnfolder]: For 20205/20591 co-relation queries the response was YES. [2023-01-27 18:05:23,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50901 conditions, 15782 events. 10128/15782 cut-off events. For 20205/20591 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 112061 event pairs, 2276 based on Foata normal form. 438/15722 useless extension candidates. Maximal degree in co-relation 50878. Up to 6337 conditions per place. [2023-01-27 18:05:23,404 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 90 selfloop transitions, 14 changer transitions 0/119 dead transitions. [2023-01-27 18:05:23,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 119 transitions, 774 flow [2023-01-27 18:05:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:05:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:05:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 753 transitions. [2023-01-27 18:05:23,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518595041322314 [2023-01-27 18:05:23,408 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 753 transitions. [2023-01-27 18:05:23,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 753 transitions. [2023-01-27 18:05:23,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:23,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 753 transitions. [2023-01-27 18:05:23,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:23,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:23,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:23,411 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 300 flow. Second operand 6 states and 753 transitions. [2023-01-27 18:05:23,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 119 transitions, 774 flow [2023-01-27 18:05:23,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 119 transitions, 769 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:05:23,455 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 384 flow [2023-01-27 18:05:23,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2023-01-27 18:05:23,456 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-01-27 18:05:23,457 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 384 flow [2023-01-27 18:05:23,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:23,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:23,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:23,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:05:23,457 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:23,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1577835879, now seen corresponding path program 1 times [2023-01-27 18:05:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738031593] [2023-01-27 18:05:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:24,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:24,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738031593] [2023-01-27 18:05:24,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738031593] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:24,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:24,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:05:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371716843] [2023-01-27 18:05:24,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:24,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:05:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:24,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:05:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:05:24,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 242 [2023-01-27 18:05:24,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 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-01-27 18:05:24,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:24,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 242 [2023-01-27 18:05:24,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:28,143 INFO L130 PetriNetUnfolder]: 19934/29275 cut-off events. [2023-01-27 18:05:28,165 INFO L131 PetriNetUnfolder]: For 84193/84193 co-relation queries the response was YES. [2023-01-27 18:05:28,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113519 conditions, 29275 events. 19934/29275 cut-off events. For 84193/84193 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 191387 event pairs, 2982 based on Foata normal form. 11/29286 useless extension candidates. Maximal degree in co-relation 113493. Up to 8740 conditions per place. [2023-01-27 18:05:28,381 INFO L137 encePairwiseOnDemand]: 229/242 looper letters, 148 selfloop transitions, 48 changer transitions 47/243 dead transitions. [2023-01-27 18:05:28,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 243 transitions, 2103 flow [2023-01-27 18:05:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:05:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:05:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 921 transitions. [2023-01-27 18:05:28,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757231404958678 [2023-01-27 18:05:28,386 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 921 transitions. [2023-01-27 18:05:28,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 921 transitions. [2023-01-27 18:05:28,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:28,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 921 transitions. [2023-01-27 18:05:28,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:28,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:28,403 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:28,403 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 384 flow. Second operand 8 states and 921 transitions. [2023-01-27 18:05:28,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 243 transitions, 2103 flow [2023-01-27 18:05:29,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 243 transitions, 1941 flow, removed 44 selfloop flow, removed 3 redundant places. [2023-01-27 18:05:29,172 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 760 flow [2023-01-27 18:05:29,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=760, PETRI_PLACES=74, PETRI_TRANSITIONS=91} [2023-01-27 18:05:29,189 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-01-27 18:05:29,189 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 760 flow [2023-01-27 18:05:29,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 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-01-27 18:05:29,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:29,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:29,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:05:29,190 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:29,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash 843163569, now seen corresponding path program 2 times [2023-01-27 18:05:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505007490] [2023-01-27 18:05:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:30,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:30,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505007490] [2023-01-27 18:05:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505007490] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:30,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:30,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:05:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128105913] [2023-01-27 18:05:30,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:30,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:05:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:05:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:05:30,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242 [2023-01-27 18:05:30,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 760 flow. Second operand has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:30,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:30,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242 [2023-01-27 18:05:30,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:33,225 INFO L130 PetriNetUnfolder]: 14685/22443 cut-off events. [2023-01-27 18:05:33,225 INFO L131 PetriNetUnfolder]: For 73760/73760 co-relation queries the response was YES. [2023-01-27 18:05:33,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101260 conditions, 22443 events. 14685/22443 cut-off events. For 73760/73760 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 149093 event pairs, 3251 based on Foata normal form. 16/22459 useless extension candidates. Maximal degree in co-relation 101229. Up to 7488 conditions per place. [2023-01-27 18:05:33,389 INFO L137 encePairwiseOnDemand]: 231/242 looper letters, 213 selfloop transitions, 83 changer transitions 69/365 dead transitions. [2023-01-27 18:05:33,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 365 transitions, 3616 flow [2023-01-27 18:05:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:05:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:05:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1180 transitions. [2023-01-27 18:05:33,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48760330578512395 [2023-01-27 18:05:33,408 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1180 transitions. [2023-01-27 18:05:33,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1180 transitions. [2023-01-27 18:05:33,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:33,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1180 transitions. [2023-01-27 18:05:33,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:33,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:33,414 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:33,414 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 760 flow. Second operand 10 states and 1180 transitions. [2023-01-27 18:05:33,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 365 transitions, 3616 flow [2023-01-27 18:05:34,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 365 transitions, 3350 flow, removed 42 selfloop flow, removed 6 redundant places. [2023-01-27 18:05:34,798 INFO L231 Difference]: Finished difference. Result has 85 places, 145 transitions, 1576 flow [2023-01-27 18:05:34,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1576, PETRI_PLACES=85, PETRI_TRANSITIONS=145} [2023-01-27 18:05:34,799 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-01-27 18:05:34,799 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 145 transitions, 1576 flow [2023-01-27 18:05:34,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:34,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:34,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:34,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:05:34,800 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:34,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1550794115, now seen corresponding path program 3 times [2023-01-27 18:05:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:34,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144197310] [2023-01-27 18:05:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144197310] [2023-01-27 18:05:35,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144197310] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:35,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:35,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:05:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173095258] [2023-01-27 18:05:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:35,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:05:35,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:35,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:05:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:05:35,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2023-01-27 18:05:35,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 145 transitions, 1576 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:35,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:35,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2023-01-27 18:05:35,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:39,234 INFO L130 PetriNetUnfolder]: 17940/27873 cut-off events. [2023-01-27 18:05:39,234 INFO L131 PetriNetUnfolder]: For 105330/105330 co-relation queries the response was YES. [2023-01-27 18:05:39,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125610 conditions, 27873 events. 17940/27873 cut-off events. For 105330/105330 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 196309 event pairs, 3774 based on Foata normal form. 28/27901 useless extension candidates. Maximal degree in co-relation 125573. Up to 10468 conditions per place. [2023-01-27 18:05:39,465 INFO L137 encePairwiseOnDemand]: 232/242 looper letters, 123 selfloop transitions, 78 changer transitions 95/296 dead transitions. [2023-01-27 18:05:39,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 296 transitions, 3408 flow [2023-01-27 18:05:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:05:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:05:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2023-01-27 18:05:39,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49586776859504134 [2023-01-27 18:05:39,488 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 720 transitions. [2023-01-27 18:05:39,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 720 transitions. [2023-01-27 18:05:39,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:39,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 720 transitions. [2023-01-27 18:05:39,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:39,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:39,491 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:39,492 INFO L175 Difference]: Start difference. First operand has 85 places, 145 transitions, 1576 flow. Second operand 6 states and 720 transitions. [2023-01-27 18:05:39,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 296 transitions, 3408 flow [2023-01-27 18:05:40,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 296 transitions, 3400 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-01-27 18:05:40,668 INFO L231 Difference]: Finished difference. Result has 92 places, 135 transitions, 1670 flow [2023-01-27 18:05:40,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1670, PETRI_PLACES=92, PETRI_TRANSITIONS=135} [2023-01-27 18:05:40,669 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-01-27 18:05:40,669 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 135 transitions, 1670 flow [2023-01-27 18:05:40,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:40,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:40,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:40,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:05:40,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:40,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1320065777, now seen corresponding path program 4 times [2023-01-27 18:05:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:40,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421288822] [2023-01-27 18:05:40,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:40,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:41,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421288822] [2023-01-27 18:05:41,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421288822] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:41,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:41,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:05:41,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671556625] [2023-01-27 18:05:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:41,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:05:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:41,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:05:41,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:05:41,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-01-27 18:05:41,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 135 transitions, 1670 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:41,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:41,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-01-27 18:05:41,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:43,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][115], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 193#(= ~x~0 1), 157#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 209#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 81#L878-3true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 101#L808true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), 58#L847true, Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 264#(= ~z~0 1), Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), 286#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 116#L775true, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-01-27 18:05:43,565 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:05:43,565 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:05:43,565 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:05:43,565 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:05:43,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][84], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(= ~x~0 1), 157#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 209#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 81#L878-3true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 264#(= ~z~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 23#L831true, Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 286#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 40#L818true, 116#L775true, 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-01-27 18:05:43,844 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,844 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,844 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,857 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,858 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][115], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(= ~x~0 1), 157#true, 109#L811true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 209#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 81#L878-3true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 264#(= ~z~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 58#L847true, Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 286#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 116#L775true, 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-01-27 18:05:43,858 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,858 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,859 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,859 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,943 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][192], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 288#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 2) (<= 0 ~main$tmp_guard0~0)), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 193#(= ~x~0 1), 157#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 81#L878-3true, P0Thread1of1ForFork1InUse, 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 106#P0EXITtrue, 101#L808true, 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), 58#L847true, Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 264#(= ~z~0 1), Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 187#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1)), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-01-27 18:05:43,943 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:43,944 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:05:44,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][149], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 288#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 2) (<= 0 ~main$tmp_guard0~0)), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(= ~x~0 1), 157#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 81#L878-3true, P0Thread1of1ForFork1InUse, 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, 106#P0EXITtrue, 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 264#(= ~z~0 1), Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 23#L831true, Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 40#L818true, 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 187#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1)), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-01-27 18:05:44,076 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:05:44,076 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:05:44,076 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:05:44,077 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:05:44,078 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][192], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 288#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 2) (<= 0 ~main$tmp_guard0~0)), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(= ~x~0 1), 157#true, 109#L811true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 81#L878-3true, P0Thread1of1ForFork1InUse, 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, 106#P0EXITtrue, 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 264#(= ~z~0 1), 58#L847true, Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 187#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1)), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-01-27 18:05:44,078 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:05:44,078 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:05:44,078 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:05:44,078 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:05:44,898 INFO L130 PetriNetUnfolder]: 11109/18228 cut-off events. [2023-01-27 18:05:44,898 INFO L131 PetriNetUnfolder]: For 64753/66022 co-relation queries the response was YES. [2023-01-27 18:05:45,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76175 conditions, 18228 events. 11109/18228 cut-off events. For 64753/66022 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 141482 event pairs, 1485 based on Foata normal form. 628/18404 useless extension candidates. Maximal degree in co-relation 76134. Up to 6857 conditions per place. [2023-01-27 18:05:45,060 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 94 selfloop transitions, 18 changer transitions 114/253 dead transitions. [2023-01-27 18:05:45,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 253 transitions, 3216 flow [2023-01-27 18:05:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:05:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:05:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-01-27 18:05:45,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500590318772137 [2023-01-27 18:05:45,085 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-01-27 18:05:45,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-01-27 18:05:45,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:45,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-01-27 18:05:45,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:45,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:45,089 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:45,089 INFO L175 Difference]: Start difference. First operand has 92 places, 135 transitions, 1670 flow. Second operand 7 states and 848 transitions. [2023-01-27 18:05:45,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 253 transitions, 3216 flow [2023-01-27 18:05:46,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 253 transitions, 2984 flow, removed 41 selfloop flow, removed 6 redundant places. [2023-01-27 18:05:46,215 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 825 flow [2023-01-27 18:05:46,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=825, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2023-01-27 18:05:46,216 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2023-01-27 18:05:46,216 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 825 flow [2023-01-27 18:05:46,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:46,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:46,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:46,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:05:46,229 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:46,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1454072826, now seen corresponding path program 1 times [2023-01-27 18:05:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510866185] [2023-01-27 18:05:46,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:46,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:05:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510866185] [2023-01-27 18:05:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510866185] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:05:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500400371] [2023-01-27 18:05:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:48,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:05:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:05:48,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:05:48,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-27 18:05:48,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 825 flow. Second operand has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:48,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:48,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-27 18:05:48,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:49,662 INFO L130 PetriNetUnfolder]: 3076/5262 cut-off events. [2023-01-27 18:05:49,662 INFO L131 PetriNetUnfolder]: For 17626/17822 co-relation queries the response was YES. [2023-01-27 18:05:49,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22790 conditions, 5262 events. 3076/5262 cut-off events. For 17626/17822 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 34873 event pairs, 630 based on Foata normal form. 122/5178 useless extension candidates. Maximal degree in co-relation 22752. Up to 2547 conditions per place. [2023-01-27 18:05:49,695 INFO L137 encePairwiseOnDemand]: 237/242 looper letters, 64 selfloop transitions, 6 changer transitions 53/141 dead transitions. [2023-01-27 18:05:49,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 1468 flow [2023-01-27 18:05:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:05:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:05:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2023-01-27 18:05:49,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48622589531680444 [2023-01-27 18:05:49,710 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2023-01-27 18:05:49,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2023-01-27 18:05:49,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:49,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2023-01-27 18:05:49,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:49,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:49,719 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:49,719 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 825 flow. Second operand 6 states and 706 transitions. [2023-01-27 18:05:49,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 1468 flow [2023-01-27 18:05:49,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 141 transitions, 1111 flow, removed 50 selfloop flow, removed 18 redundant places. [2023-01-27 18:05:49,817 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 515 flow [2023-01-27 18:05:49,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2023-01-27 18:05:49,826 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2023-01-27 18:05:49,826 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 515 flow [2023-01-27 18:05:49,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:49,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:49,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:49,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:05:49,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:49,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1954623648, now seen corresponding path program 2 times [2023-01-27 18:05:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:49,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947285996] [2023-01-27 18:05:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:05:49,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:05:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:05:50,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:05:50,103 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:05:50,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:05:50,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:05:50,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:05:50,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:05:50,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:05:50,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:05:50,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:05:50,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:05:50,108 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:50,114 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:05:50,114 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:05:50,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:05:50 BasicIcfg [2023-01-27 18:05:50,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:05:50,251 INFO L158 Benchmark]: Toolchain (without parser) took 58092.23ms. Allocated memory was 425.7MB in the beginning and 11.3GB in the end (delta: 10.8GB). Free memory was 370.8MB in the beginning and 10.0GB in the end (delta: -9.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-01-27 18:05:50,251 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 308.3MB. Free memory is still 255.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:05:50,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.23ms. Allocated memory is still 425.7MB. Free memory was 370.8MB in the beginning and 346.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:05:50,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.42ms. Allocated memory is still 425.7MB. Free memory was 346.7MB in the beginning and 344.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:05:50,252 INFO L158 Benchmark]: Boogie Preprocessor took 65.32ms. Allocated memory is still 425.7MB. Free memory was 344.2MB in the beginning and 342.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:05:50,253 INFO L158 Benchmark]: RCFGBuilder took 1285.38ms. Allocated memory is still 425.7MB. Free memory was 342.1MB in the beginning and 364.6MB in the end (delta: -22.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.0GB. [2023-01-27 18:05:50,253 INFO L158 Benchmark]: TraceAbstraction took 55810.03ms. Allocated memory was 425.7MB in the beginning and 11.3GB in the end (delta: 10.8GB). Free memory was 364.6MB in the beginning and 10.0GB in the end (delta: -9.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-01-27 18:05:50,254 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.12ms. Allocated memory is still 308.3MB. Free memory is still 255.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 829.23ms. Allocated memory is still 425.7MB. Free memory was 370.8MB in the beginning and 346.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 90.42ms. Allocated memory is still 425.7MB. Free memory was 346.7MB in the beginning and 344.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 65.32ms. Allocated memory is still 425.7MB. Free memory was 344.2MB in the beginning and 342.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1285.38ms. Allocated memory is still 425.7MB. Free memory was 342.1MB in the beginning and 364.6MB in the end (delta: -22.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.0GB. * TraceAbstraction took 55810.03ms. Allocated memory was 425.7MB in the beginning and 11.3GB in the end (delta: 10.8GB). Free memory was 364.6MB in the beginning and 10.0GB in the end (delta: -9.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 140 PlacesBefore, 44 PlacesAfterwards, 129 TransitionsBefore, 32 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 9535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3719, independent: 3465, independent conditional: 0, independent unconditional: 3465, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1742, independent: 1698, independent conditional: 0, independent unconditional: 1698, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3719, independent: 1767, independent conditional: 0, independent unconditional: 1767, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 1742, unknown conditional: 0, unknown unconditional: 1742] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t177; [L872] FCALL, FORK 0 pthread_create(&t177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t177, ((void *)0), P0, ((void *)0))=-1, t177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t178; [L874] FCALL, FORK 0 pthread_create(&t178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t178, ((void *)0), P1, ((void *)0))=0, t177={5:0}, t178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t179; [L876] FCALL, FORK 0 pthread_create(&t179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t179, ((void *)0), P2, ((void *)0))=1, t177={5:0}, t178={6:0}, t179={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t180; [L878] FCALL, FORK 0 pthread_create(&t180, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t180, ((void *)0), P3, ((void *)0))=2, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 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: 55.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 784 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 784 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1814 IncrementalHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 53 mSDtfsCounter, 1814 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1670occurred in iteration=11, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 2132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:05:50,292 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...